Hybrid Optimal Control of Motorized Traveling Salesmen and Beyond

نویسندگان

  • Markus Glocker
  • Oskar von Stryk
چکیده

Numerical methods for optimal control of hybrid dynamical systems are considered where the discrete dynamics and the nonlinear continuous dynamics are tightly coupled. A decomposition approach for numerically solving general mixed-integer continuous optimal control problems (MIOCPs) is discussed. In the outer optimization loop a branch-and-bound binary tree search is used for the discrete variables. The multiple-phase optimal control problems for the continuous state and control variables in the inner optimization loop are solved by a sparse direct collocation transcription method. A genetic algorithm is applied to improve the performance of the branch-and-bound approach by providing a good initial upper bound on the MIOCP performance index. Results are presented for motorized traveling salesmen problems, new benchmark problems in hybrid optimal control.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical mixed-integer optimal control and motorized traveling salesmen problems

A general approach for the numerical solution of hybrid, mixed-integer optimal control problems is presented. In an outer level iteration a branch-and-bound procedure is applied to search the entire feasible discrete variable space. An inner level iteration contains for each actual value of the discrete variable a continuous nonlinear optimal control problem with its nonlinear dynamics defined ...

متن کامل

Decomposition of Mixed-Integer Optimal Control Problems Using Branch and Bound and Sparse Direct Collocation

A large class of optimal control problems for hybrid dynamic systems can be formulated as mixed-integer optimal control problems (MIOCPs). It is the intrinsic combinatorial complexity, in addition to the nonlinearity of the continuous, multi-phase optimal control problems that is largely responsible for the challenges in the theoretical and numerical solution of MIOCPs. We present a new decompo...

متن کامل

An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem

The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...

متن کامل

Towards Hybrid Optimal Control

In this article a general class of hybrid optimal control problems with continuous and discrete state variables and control inputs is defined. After a brief review of conventional optimal control, major novel challenges resulting from the hybrid nature are discussed. Some application problems are comparatively easy to solve because of the fixed or known sequence of discrete events; however, if ...

متن کامل

Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks

While there are optimal TSP solvers as well as recent learning-based approaches, the generalization of the TSP to the multiple Traveling Salesmen Problem is much less studied. Here, we design a neural network solution that treats the salesmen, the cities, and the depot as three different sets of varying cardinalities. Coupled with a normalization algorithm, a dedicated loss, and a search method...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002